Cryptographic random and pseudorandom data generators
نویسنده
چکیده
This dissertation thesis deals with cryptographic random and pseudorandom data generators in mobile computing environments (such as mobile phones, personal digital assistants, cryptographic smartcards). These mobile devices are typically bounded by the amount of energy, performance, memory or even silicon area. This lack of resources leads to very limited computing environments with: a) limited number of sources of randomness for reliable true random data generator; b) limited number of pseudorandom data generators (or other methods of digital post-processing) suitable for secure and efficient implementation (in this mobile environment). In the first chapter we explain the basics of random and pseudorandom data generation for cryptography purposes and also all necessary terminology. The second chapter is organized as a survey of basic requirements on random and pseudorandom data, fundamental results in the field and description of several experiments with cryptographic smartcards. In the last part of this chapter we also discuss a novel idea of distributed random data generation. The third chapter is dedicated to identification and analysis of available sources of randomness in mobile computing environments. The fourth chapter focuses on the secure and efficient digital post-processing of truly random data with the use of randomness extractors or pseudorandom data generators. The fifth chapter presents technical details regarding the integration of our design prototype into selected mobile devices (smartphone Nokia N73 with Symbian OS). The main contribution of this dissertation is the identification and analysis of available sources of randomness in mobile devices, secure integration of selected digital post-processing methods (resulting in a design prototype) and the analysis of approaches to distributed random data generation.
منابع مشابه
Analysis, demands, and properties of pseudorandom number generators
The goal of this paper is to create a comprehensive overview of demands of common cryptographic schemes (e.g., various cryptosystems, cryptographic protocols, or authentication mechanisms) on random or pseudorandom number generation, including the analysis of properties of common pseudorandom number generators (PRNGs).
متن کاملA Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable...
متن کاملOn Stochastic Security of Pseudorandom Sequences
Cryptographic primitives such as secure hash functions (e.g., SHA1, SHA2, and SHA3) and symmetric key block ciphers (e.g., AES and TDES) have been commonly used to design pseudorandom generators with counter modes (e.g., in NIST SP800-90A standards). It is assumed that if these primitives are secure then the sequences generated by pseudorandom generators based on these primitives are indistingu...
متن کاملCompact FPGA-based True and Pseudo Random Number Generators
Two FPGA based implementations of random number generators intended for embedded cryptographic applications are presented. The first is a true random number generator (TRNG) which employs oscillator phase noise, and the second is a bit serial implementation of a Blum Blum Shub (BBS) pseudorandom number generator (PRNG). Both designs are extremely compact and can be implemented on any FPGA or PL...
متن کاملOn the Design of LIL Tests for (Pseudo) Random Generators and Some Experimental Results
Random numbers have been one of the most useful objects in statistics, computer science, cryptography, modeling, simulation, and other applications though it is very difficult to construct true randomness. Many solutions (e.g., cryptographic pseudorandom generators) have been proposed to harness or simulate randomness and many statistical testing techniques have been proposed to determine wheth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009